Coloring of Intuitionistic Fuzzy Directed Hypergraphs
نویسندگان
چکیده
A hypergraph is a set V of vertices and a set E of non-empty subsets of V , called hyperedges. Unlike graphs, hypergraphs can perform higher-order interactions in social and communication networks. Directed hypergraphs are much like directed graphs. Colors are used to distinguish the classes. Coloring a hypergraph H must assign atleast two different colors to the vertices of every hyperedge. That is, no edge is monochromatic. In this paper, p-coloring, K-coloring, p-chromatic number, spike and spike reduction of intuitionistic fuzzy directed hypergraph (IFDHG), skeleton of spike reduction are studied. Further, a few properties of coloring of intuitionistic fuzzy directed hypergraph are discussed. Also, it has been proved that in an ordered IFDHG, a primitive coloring is a K-coloring of the IFDHG.
منابع مشابه
Arc-coloring of directed hypergraphs and chromatic number of walls
We define an arc-coloring for directed hypergraphs, such that any two arcs having either intersecting tails or the same head must be colored differently. We investigate the arc-coloring of those hypergraphs which can be represented by suitable adjacency matrices (walls), whereas a polynomial reduction is provided from the general arc-coloring problem to the brick-coloring of walls. An upper bou...
متن کاملCertain networks models using single-valued neutrosophic directed hypergraphs
A directed hypergraph is powerful tool to solve the problems that arises in different fields, including computer networks, social networks and collaboration networks. In this research paper, we apply the concept of single-valued neutrosophic sets to directed hypergraphs. We introduce certain new concepts, including single-valued neutrosophic directed hypergraphs, single-valued neutrosophic line...
متن کاملDirected domination in oriented hypergraphs
ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...
متن کاملReduction of a nilpotent intuitionistic fuzzy matrix using implication operator
A problem of reducing intuitionistic fuzzy matrices is examined and some useful properties are obtained with respect to nilpotent intutionistic fuzzy matrices. First, reduction of irreflexive and transitive intuitionistic fuzzy matrices are considered, and then the properties are applied to nilpotent intutionistic fuzzy matrices. Nilpotent intuitionistic fuzzy matrices are intuitionistic fuzzy ...
متن کاملOn Fuzzy $e$-open Sets, Fuzzy $e$-continuity and Fuzzy $e$-compactness in Intuitionistic Fuzzy Topological Spaces
The purpose of this paper is to introduce and study the concepts of fuzzy $e$-open set, fuzzy $e$-continuity and fuzzy $e$-compactness in intuitionistic fuzzy topological spaces. After giving the fundamental concepts of intuitionistic fuzzy sets and intuitionistic fuzzy topological spaces, we present intuitionistic fuzzy $e$-open sets and intuitionistic fuzzy $e$-continuity and other results re...
متن کامل